0.12/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/0.16 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.16/0.37 % Computer : n010.cluster.edu 0.16/0.37 % Model : x86_64 x86_64 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.16/0.37 % Memory : 8042.1875MB 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64 0.16/0.37 % CPULimit : 1200 0.16/0.37 % WCLimit : 120 0.16/0.37 % DateTime : Tue Jul 13 15:49:51 EDT 2021 0.16/0.38 % CPUTime : 0.16/0.38 % Number of cores: 8 0.16/0.38 % Python version: Python 3.6.8 0.16/0.38 # Version: 2.6rc1-ho 0.16/0.40 # No SInE strategy applied 0.16/0.40 # Trying AutoSched0 for 59 seconds 0.24/0.53 # AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y 0.24/0.53 # and selection function SelectMaxLComplexAvoidPosPred. 0.24/0.53 # 0.24/0.53 # Preprocessing time : 0.066 s 0.24/0.53 0.24/0.53 # Proof found! 0.24/0.53 # SZS status Theorem 0.24/0.53 # SZS output start CNFRefutation 0.24/0.53 thf(conj_0, conjecture, (path_p769714271omplex @ (comp_a_complex_real @ poinca1910941596x_of_a @ c))=(path_p797330068omplex @ (comp_a_complex_real @ poinca1910941596x_of_a @ c)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)). 0.24/0.53 thf(fact_13_pathfinish__compose, axiom, ![X2:a > complex, X227:real > a]:(path_p769714271omplex @ (comp_a_complex_real @ X2 @ X227))=(X2 @ (path_pathfinish_a @ X227)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_13_pathfinish__compose)). 0.24/0.53 thf(fact_18_pathstart__compose, axiom, ![X2:a > complex, X227:real > a]:(path_p797330068omplex @ (comp_a_complex_real @ X2 @ X227))=(X2 @ (path_pathstart_a @ X227)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_18_pathstart__compose)). 0.24/0.53 thf(fact_0_assms_I2_J, axiom, (path_pathfinish_a @ c)=(path_pathstart_a @ c), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_0_assms_I2_J)). 0.24/0.53 thf(c_0_4, negated_conjecture, (path_p769714271omplex @ (comp_a_complex_real @ poinca1910941596x_of_a @ c))!=(path_p797330068omplex @ (comp_a_complex_real @ poinca1910941596x_of_a @ c)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 0.24/0.53 thf(c_0_5, plain, ![X2791:a > complex, X2792:real > a]:(path_p769714271omplex @ (comp_a_complex_real @ X2791 @ X2792))=(X2791 @ (path_pathfinish_a @ X2792)), inference(variable_rename,[status(thm)],[fact_13_pathfinish__compose])). 0.24/0.53 thf(c_0_6, plain, ![X2678:a > complex, X2679:real > a]:(path_p797330068omplex @ (comp_a_complex_real @ X2678 @ X2679))=(X2678 @ (path_pathstart_a @ X2679)), inference(variable_rename,[status(thm)],[fact_18_pathstart__compose])). 0.24/0.53 thf(c_0_7, negated_conjecture, (path_p769714271omplex @ (comp_a_complex_real @ poinca1910941596x_of_a @ c))!=(path_p797330068omplex @ (comp_a_complex_real @ poinca1910941596x_of_a @ c)), inference(split_conjunct,[status(thm)],[c_0_4])). 0.24/0.53 thf(c_0_8, plain, ![X2:a > complex, X3:real > a]:(path_p769714271omplex @ (comp_a_complex_real @ X2 @ X3))=(X2 @ (path_pathfinish_a @ X3)), inference(split_conjunct,[status(thm)],[c_0_5])). 0.24/0.53 thf(c_0_9, plain, (path_pathfinish_a @ c)=(path_pathstart_a @ c), inference(split_conjunct,[status(thm)],[fact_0_assms_I2_J])). 0.24/0.53 thf(c_0_10, plain, ![X2:a > complex, X3:real > a]:(path_p797330068omplex @ (comp_a_complex_real @ X2 @ X3))=(X2 @ (path_pathstart_a @ X3)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.24/0.53 thf(c_0_11, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7, c_0_8]), c_0_9]), c_0_10])]), ['proof']). 0.24/0.53 # SZS output end CNFRefutation 0.24/0.53 # Proof object total steps : 12 0.24/0.53 # Proof object clause steps : 5 0.24/0.53 # Proof object formula steps : 7 0.24/0.53 # Proof object conjectures : 4 0.24/0.53 # Proof object clause conjectures : 2 0.24/0.53 # Proof object formula conjectures : 2 0.24/0.53 # Proof object initial clauses used : 4 0.24/0.53 # Proof object initial formulas used : 4 0.24/0.53 # Proof object generating inferences : 0 0.24/0.53 # Proof object simplifying inferences : 4 0.24/0.53 # Training examples: 0 positive, 0 negative 0.24/0.53 # Parsed axioms : 466 0.24/0.53 # Removed by relevancy pruning/SinE : 0 0.24/0.53 # Initial clauses : 574 0.24/0.53 # Removed in clause preprocessing : 119 0.24/0.53 # Initial clauses in saturation : 455 0.24/0.53 # Processed clauses : 460 0.24/0.53 # ...of these trivial : 45 0.24/0.53 # ...subsumed : 58 0.24/0.53 # ...remaining for further processing : 356 0.24/0.53 # Other redundant clauses eliminated : 288 0.24/0.53 # Clauses deleted for lack of memory : 0 0.24/0.53 # Backward-subsumed : 0 0.24/0.53 # Backward-rewritten : 11 0.24/0.53 # Generated clauses : 1541 0.24/0.53 # ...of the previous two non-trivial : 866 0.24/0.53 # Contextual simplify-reflections : 0 0.24/0.53 # Paramodulations : 576 0.24/0.53 # Factorizations : 0 0.24/0.53 # NegExts : 95 0.24/0.53 # Equation resolutions : 354 0.24/0.53 # Propositional unsat checks : 0 0.24/0.53 # Propositional check models : 0 0.24/0.53 # Propositional check unsatisfiable : 0 0.24/0.53 # Propositional clauses : 0 0.24/0.53 # Propositional clauses after purity: 0 0.24/0.53 # Propositional unsat core size : 0 0.24/0.53 # Propositional preprocessing time : 0.000 0.24/0.53 # Propositional encoding time : 0.000 0.24/0.53 # Propositional solver time : 0.000 0.24/0.53 # Success case prop preproc time : 0.000 0.24/0.53 # Success case prop encoding time : 0.000 0.24/0.53 # Success case prop solver time : 0.000 0.24/0.53 # Current number of processed clauses : 338 0.24/0.53 # Positive orientable unit clauses : 67 0.24/0.53 # Positive unorientable unit clauses: 0 0.24/0.53 # Negative unit clauses : 1 0.24/0.53 # Non-unit-clauses : 270 0.24/0.53 # Current number of unprocessed clauses: 861 0.24/0.53 # ...number of literals in the above : 2489 0.24/0.53 # Current number of archived formulas : 0 0.24/0.53 # Current number of archived clauses : 12 0.24/0.53 # Clause-clause subsumption calls (NU) : 15255 0.24/0.53 # Rec. Clause-clause subsumption calls : 12237 0.24/0.53 # Non-unit clause-clause subsumptions : 58 0.24/0.53 # Unit Clause-clause subsumption calls : 560 0.24/0.53 # Rewrite failures with RHS unbound : 0 0.24/0.53 # BW rewrite match attempts : 95 0.24/0.53 # BW rewrite match successes : 11 0.24/0.53 # Condensation attempts : 0 0.24/0.53 # Condensation successes : 0 0.24/0.53 # Termbank termtop insertions : 56108 0.24/0.53 0.24/0.53 # ------------------------------------------------- 0.24/0.53 # User time : 0.142 s 0.24/0.53 # System time : 0.008 s 0.24/0.53 # Total time : 0.150 s 0.24/0.53 # Maximum resident set size: 2604 pages 0.24/0.53 EOF